The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
نویسندگان
چکیده
منابع مشابه
The Douglas-Peucker Algorithm: Sufficiency Conditions for Non-Self-Intersections
The classic Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It may, however, produce simplified polyline that is not topologically equivalent to the original one consisting of all vertex samples. On the basis of properties of the polyline hulls, Saalfeld devised a simple rule for detecting topologica...
متن کاملA Non-Self-Intersection Douglas-Peucker Algorithm
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensively for both computer graphics and geographic information systems. There are two variants of this algorithm, the original O(nm) method, where n denotes the number of input vertices and m the number of output segments, th...
متن کاملSpeeding Up the Douglas-Peucker Line-Simpli cation Algorithm
We analyze the line simpli cation algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls, that uses the geometric structure of the problem to attain a worst-case running time proportional to n log 2 n, which is the best case of the Douglas algorithm. We give complete C code and compare t...
متن کاملThe Douglas-Peucker Algorithm for Line Simplification: Re-evaluation through Visualization
The primary aim of this paper is to illustrate the value of visualization in cartography and to indicate that tools for the generation and manipulation of realistic images are of limited value within this application. This paper demonstrates the value of visualization within one problem in cartography, namely the generalisation of lines. It reports on the evaluation of the Douglas-Peucker algor...
متن کاملA Parallel Implementation of the Douglas-Peucker Line Simplification
As parallel machines become more widely available, many existing algorithms are being converted to take advantage of the improved speed offered by such computers. However, the method by which the algorithm is distributed is crucial towards obtaining the speed-ups required for many real-time tasks. This paper presents three parallel implementations of the Douglas-Peucker line simplification algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2004
ISSN: 0104-6500
DOI: 10.1590/s0104-65002004000100006